Kernel-based interpolation at approximate Fekete points

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approximate Fekete Points for Weighted Polynomial Interpolation

We compute approximate Fekete points for weighted polynomial interpolation by a recent algorithm based on QR factorizations of Vandermonde matrices. We consider in particular the case of univariate and bivariate functions with prescribed poles or other singularities, which are absorbed in the basis by a weight function. Moreover, we apply the method to the construction of real and complex weigh...

متن کامل

Fekete Points

In this communication we present a new method to estimate Fekete points on surfaces. Our method works in a general setting, in the sense that we can obtain good estimations of the Fekete points on piecewise regular surfaces. The determination of Fekete points in the unit sphere is considered as a model of a highly non-linear optimization problem with non-linear constraints. In fact, obtaining a...

متن کامل

On the Calculation of Approximate Fekete Points: the Univariate Case

We discuss some theoretical aspects of the univariate case of the method recently introduced by Sommariva and Vianello [12] for the calculation of approximate Fekete points for polynomial interpolation.

متن کامل

Computing approximate Fekete points by QR factorizations of Vandermonde matrices

We propose a numerical method (implemented in Matlab) for computing algebraic quadrature nodes and weights on compact multivariate domains. It relies on the search of maximum volume submatrices of Vandermonde matrices in suitable polynomial bases, by a greedy algorithm based on QR factorization with column pivoting. Such nodes are approximate Fekete points, and are good also for polynomial inte...

متن کامل

Polynomial approximation and cubature at approximate Fekete and Leja points of the cylinder

The paper deals with polynomial interpolation, least-square approximation and cubature of functions defined on the rectangular cylinder, K = D × [−1, 1], with D the unit disk. The nodes used for these processes are the Approximate Fekete Points (AFP) and the Discrete Leja Points (DLP) extracted from suitable Weakly Admissible Meshes (WAMs) of the cylinder. ¿From the analysis of the growth of th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Numerical Algorithms

سال: 2020

ISSN: 1017-1398,1572-9265

DOI: 10.1007/s11075-020-00973-y